On Transactional Scheduling in Distributed Transactional Memory Systems

نویسندگان

  • Junwhan Kim
  • Binoy Ravindran
چکیده

We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval categorizes concurrent requests for a shared object into read and write intervals to maximize the parallelism of reading transactions. This allows an object to be simultaneously sent to nodes of reading transactions (in a data flow TM model), improving transactional makespan. We show that Biinterval improves the makespan competitive ratio of the Relay distributed TM cache coherence protocol to O(log(n)) for the worst-case and Θ log(n− k) for the average-case, for n nodes and k reading transactions. Our implementation studies confirm Bi-interval’s throughput improvement by as much as 200% ∼ 30%, over cache-coherence protocol-only distributed TM.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Semantics of Progress and Concurrency in Distributed Transactional Memory Systems

Transactional memory (TM) is an alternative synchronization model for shared in memory data objects that promise to alleviate difficulties with lock-based synchronization (e.g., lack of compositionality, deadlocks, lock convoying). A transaction is a sequence of operations, performed by a single thread, for reading and writing shared objects. Distributed TM is motivated by the similar difficult...

متن کامل

Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory

Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. The design of the cache-coherence protocol is critical to the performance of distributed transactio...

متن کامل

Scheduling Open-Nested Transactions in Distributed Transactional Memory

Distributed transactional memory (DTM) is a powerful concurrency control model for distributed systems sparing the programmer from the complexity of manual implementation of lock-based distributed synchronization. We consider Herlihy and Sun’s dataflow DTM model, where objects are migrated to invoking transactions, and the open nesting model of managing inner (distributed) transactions. In this...

متن کامل

Designing a Distributed Software Transactional Memory System

Distributed systems are widely used in high performance computing for performing computationally extensive calculations. In programming terms, distributed systems have usually been exploited through the use of dedicated APIs such as OpenMP and MPI. With these programming models, synchronization is achieved using locks and barriers, and is complex to implement correctly. Transactional memory is ...

متن کامل

Scheduling in Transactional Memory Systems : Models , Algorithms , and Evaluations

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010